Contraction theorems in Hamiltonian graph theory
نویسندگان
چکیده
منابع مشابه
Evolutionary Hamiltonian Graph Theory
We present an alternative domain concerning mathematics to investigate universal evolution mechanisms by focusing on large cycles theory (LCT)-a simplified version of well-known hamiltonian graph theory. LCT joins together a number of N P-complete cycle problems in graph theory. N P-completeness is the kay factor insuring (by conjecture of Cook) the generation of endless developments and great ...
متن کاملOn some intriguing problems in hamiltonian graph theory--a survey
We survey results and open problems in hamiltonian graph theory centred around three themes: regular graphs, t-tough graphs, and claw-free graphs.
متن کاملCommon fixed point of multivalued graph contraction in metric spaces
In this paper, we introduce the (G-$psi$) contraction in a metric space by using a graph. Let $F,T$ be two multivalued mappings on $X.$ Among other things, we obtain a common fixed point of the mappings $F,T$ in the metric space $X$ endowed with a graph $G.$
متن کاملPreservation theorems in {L}ukasiewicz \model theory
We present some model theoretic results for {L}ukasiewiczpredicate logic by using the methods of continuous model theorydeveloped by Chang and Keisler.We prove compactness theorem with respect to the class of allstructures taking values in the {L}ukasiewicz $texttt{BL}$-algebra.We also prove some appropriate preservation theorems concerning universal and inductive theories.Finally, Skolemizatio...
متن کاملCommon Fixed-Point Theorems For Generalized Fuzzy Contraction Mapping
In this paper we investigate common xed point theorems for contraction mapping in fuzzy metric space introduced by Gregori and Sapena [V. Gregori, A. Sapena, On xed-point the- orems in fuzzy metric spaces, Fuzzy Sets and Systems, 125 (2002), 245-252].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1981
ISSN: 0012-365X
DOI: 10.1016/0012-365x(81)90022-4